1811B - Conveyor Belts - CodeForces Solution

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#define ll                long long
#define F                 first
#define S                 second
#define pb                push_back
#define all(c)            (c).begin(),(c).end()
#define EPS               1.0e-8
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>

template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
    cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
    cin >> p.first;
    return cin >> p.second;
}
ll fastpow(ll base, ll power, ll M){
    if (power == 0) return 1;
    if (power == 1) return base;
    ll val = fastpow(base, power / 2, M);
    return (power % 2 == 0) ? (val * val) % M : (((val * val) % M) * base) % M;
}
inline void debugMode() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};

int main(){
    debugMode();
    int t; cin >> t;
    while(t--){
        int n, x1, y1, x2, y2;
        cin >> n >> x1 >> y1 >> x2 >> y2;

        int diff1 = min({x1 - 1, n - x1, y1 - 1, n - y1});
        int diff2 = min({x2 - 1, n - x2, y2 - 1, n - y2});

        cout << abs(diff1 - diff2) << '\n';
    }
    return 0;
}